A majorant principle for multipoint iterations without memory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal order of multipoint iterations using n evaluations

This paper deals with multipoint iterations without memory for the solution of the nonlinear scalar equation (m) f (x) = 0, m ^ 0. Let P n( ) be the maximal order of iterations which use n evaluations of the function or its derivatives per step. We prove the Kung and Traub conjecture p (0) = 2 n ^ for Hermitian information. We show p (m+l)^p (m) and conjecture P n( ) = 2 . The problem of the ma...

متن کامل

Hyperaccurate Ellipse Fitting without Iterations

This paper presents a new method for fitting an ellipse to a point sequence extracted from images. It is widely known that the best fit is obtained by maximum likelihood. However, it requires iterations, which may not converge in the presence of large noise. Our approach is algebraic distance minimization; no iterations are required. Exploiting the fact that the solution depends on the way the ...

متن کامل

Design of a Multiplier for Similar Base Numbers Without Converting Base Using a Data Oriented Memory

One the challenging in hardware performance is to designing a high speed calculating unit. The higher of calculations speeds in a computer system  will be pointed out in terms of performance. As a result, designing a high speed calculating unit is of utmost importance. In this paper, we start design whit this knowledge that one multiplier made of several adder and one divider made of several su...

متن کامل

A Majorant Problem

Let f(z) akzk a 0 be analytlc in the unlt disc. Any k=O o Inflnlte complex vector e (eo,et,e2 ) such that lekl 1, k 0,1,2 induces a function re(Z) akekZk whlch is still analytic k=O In the unit disc. In this paper we study the problem of maximizing the p-means: over all possible vectors e and for values of r close to 0 and for all p<2. k It is proved that a maxlmlzlng function Is f,{z} -laoi + ...

متن کامل

High Accuracy Homography Computation without Iterations

We present a highly accurate least-squares (LS) alternative to the theoretically optimal maximum likelihood (ML) estimator for homographies between two images. Unlike ML, our estimator is non-iterative and yields a solution even in the presence of large noise. By rigorous error analysis, we derive a “hyperLS” estimator which is unbiased up to second order noise terms. We also introduce a comput...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicationes Mathematicae

سال: 1980

ISSN: 1233-7234,1730-6280

DOI: 10.4064/am-17-1-109-116